Upper and lower bounds on the cost of a map-reduce computation
نویسندگان
چکیده
منابع مشابه
Upper and Lower Bounds on the Cost of a Map-Reduce Computation
In this paper we study the tradeoff between parallelism and communication cost in a map-reduce computation. For any problem that is not “embarrassingly parallel,” the finer we partition the work of the reducers so that more parallelism can be extracted, the greater will be the total communication between mappers and reducers. We introduce a model of problems that can be solved in a single round...
متن کاملa study on the effectiveness of textual modification on the improvement of iranian upper-intermediate efl learners’ reading comprehension
این پژوهش به منظور بررسی تأثیر اصلاح متنی بر بهبود توانایی درک مطلب زبان آموزان ایرانی بالاتر از سطح میانی انجام پذیرفت .بدین منظور 115 دانشجوی مرد و زن رشته مترجمی زبان انگلیسی در این پزوهش شرکت نمودند.
Upper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملUpper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملUpper and Lower Bounds on Continuous-Time Computation
We consider various extensions and modifications of Shannon’s General Purpose Analog Computer, which is a model of computation by differential equations in continuous time. We show that several classical computation classes have natural analog counterparts, including the primitive recursive functions, the elementary functions, the levels of the Grzegorczyk hierarchy, and the arithmetical and an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2013
ISSN: 2150-8097
DOI: 10.14778/2535570.2488334